Minimum Redundancy Cut in Ontologies for Semantic Indexing
نویسندگان
چکیده
This paper presents a new method that aims at improving semantic indexing while reducing the number of indexing terms. Indexing terms are determined using a minimum redundancy cut in a hierarchy of conceptual hypernyms provided by an ontology (e.g. WordNet, EDR). The results of some information retrieval experiments carried out on several standard document collections using the EDR ontology are presented, illustrating the benefit of the method.
منابع مشابه
Enriching Ontologies with Encyclopedic Background Knowledge for Document Indexing
The rapidly increasing number of scientific documents available publicly on the Internet creates the challenge of efficiently organizing and indexing these documents. Due to the time consuming and tedious nature of manual classification and indexing, there is a need for better methods to automate this process. This thesis proposes an approach which leverages encyclopedic background knowledge fo...
متن کاملOntologies For The Semantic-Based Medical Image Indexing: An Overview
Image retrieval by content is characterized by the ability of a system to retrieve relevant images based on their visual or their semantic contents. In this paper, we survey key contributions in the medical imaging area. We centre our attention on one related sub-fields: the semantic indexing process. We describe limitations of visual approaches and provide taxonomy for semantic ones with an em...
متن کاملAn Ontology-Based Latent Semantic Indexing Approach Using Long Short-Term Memory Networks
Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملTight Bounds for Gomory-Hu-like Cut Counting
By a classical result of Gomory and Hu (1961), in every edgeweighted graph G = (V,E,w), the minimum st-cut values, when ranging over all s, t ∈ V , take at most |V |−1 distinct values. That is, these (|V | 2 ) instances exhibit redundancy factor Ω(|V |). They further showed how to construct from G a tree (V,E′, w′) that stores all minimum st-cut values. Motivated by this result, we obtain tight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005